Averaging along Uniform Random Integers

نویسنده

  • ÉLISE JANVRESSE
چکیده

Motivated by giving a meaning to “The probability that a random integer has initial digit d”, we define a URI-set as a random set E of natural integers such that each n ≥ 1 belongs to E with probability 1/n, independently of other integers. This enables us to introduce two notions of densities on natural numbers: The URI-density, obtained by averaging along the elements of E, and the local URI-density, which we get by considering the k-th element of E and letting k go to ∞. We prove that the elements of E satisfy Benford’s law, both in the sense of URI-density and in the sense of local URI-density. Moreover, if b1 and b2 are two multiplicatively independent integers, then the mantissae of a natural number in base b1 and in base b2 are independent. Connections of URI-density and local URI-density with other well-known notions of densities are established: Both are stronger than the natural density, and URI-density is equivalent to log-density. We also give a stochastic interpretation, in terms of URI-set, of the H∞-density.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating random factored Gaussian integers, easily

We present a (random) polynomial-time algorithm to generate a randomGaussian integer with the uniform distribution among those with norm at most N , along with its prime factorization. The method generalizes to finding a random ideal in the ring of integers of a quadratic number field together with its prime ideal factorization. We also discuss the analogous problem for higher degree number fie...

متن کامل

Some difficult-to-pass tests of randomness

We describe three tests of randomness—tests that many random number generators fail. In particular, all congruential generators—even those based on a prime modulus—fail at least one of the tests, as do many simple generators, such as shift register and lagged Fibonacci. On the other hand, generators that pass the three tests seem to pass all the tests in the Diehard Battery of Tests. Note that ...

متن کامل

The Random Average Process and Random Walk in a Space-time Random Environment in One Dimension

We study space-time fluctuations around a characteristic line for a onedimensional interacting system known as the random average process. The state of this system is a real-valued function on the integers. New values of the function are created by averaging previous values with random weights. The fluctuations analyzed occur on the scale n where n is the ratio of macroscopic and microscopic sc...

متن کامل

Uniform distribution and algorithmic randomness

Abstract. A seminal theorem due to Weyl [14] states that if (an) is any sequence of distinct integers, then, for almost every x ∈ R, the sequence (anx) is uniformly distributed modulo one. In particular, for almost every x in the unit interval, the sequence (anx) is uniformly distributed modulo one for every computable sequence (an) of distinct integers. Call such an x UD random. Here it is sho...

متن کامل

Divergence bounds for random fixed-weight vectors obtained by sorting

This note analyzes the distribution of fixed-weight vectors obtained by the following procedure: generate a sequence of uniform random integers with a moderate number of bits; force the bottom bits of the sequence to be a standard fixed-weight vector; sort the sequence; and extract the bottom bits. This note shows, for example, that this procedure with 32-bit integers produces any particular we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011